Diagonal algebras

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rees Algebras of Diagonal Ideals

There is a natural epimorphism from the symmetric algebra to the Rees algebra of an ideal. When this epimorphism is an isomorphism, we say that the ideal is of linear type. Given two determinantal rings over a field, we consider the diagonal ideal, kernel of the multiplication map. We prove in many cases that the diagonal ideal is of linear type and recover the defining ideal of the Rees algebr...

متن کامل

Diagonal Bases in Orlik-solomon Type Algebras

To encode an important property of the “no broken circuit bases” of the Orlik-Solomon-Terao algebras, András Szenes has introduced a particular type of bases, the so called “diagonal basis”. We prove that this definition extends naturally to a large class of algebras, the so called χ-algebras. Our definitions make also use of an “iterative residue formula” based on the matroidal operation of co...

متن کامل

Diagonal Coinvariants and Double Affine Hecke Algebras

It was conjectured by Haiman [H] that the space of diagonal coinvariants for a root system R of rank n has a ”natural” quotient of dimension (1 + h) for the Coxeter number h. This space is the quotient C[x, y]/(C[x, y]C[x, y]o ) for the algebra of polynomials C[x, y] with the diagonal action of the Weyl group on x ∈ C ∋ y and the ideal C[x, y]o ⊂ C[x, y] of the W -invariant polynomials without ...

متن کامل

Categories of Locally Diagonal Partial Algebras

We define and study the property of local diagonality for partial algebras and also a pair of related properties. We show that each of the three properties, together with idempotency, gives a cartesian closed initially structured subcategory of the category of all partial algebras of a given type. MSC 2000: 08A55, 08C05, 18D15

متن کامل

A Numerical Algorithm for Block-diagonal Decomposition of Matrix ∗-algebras

Motivated by recent interest in group-symmetry in the area of semidefinite programming, we propose a numerical method for finding a finest simultaneous block-diagonalization of a finite number of symmetric matrices, or equivalently the irreducible decomposition of the matrix ∗-algebra generated by symmetric matrices. The method does not require any algebraic structure to be known in advance, wh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fundamenta Mathematicae

سال: 1966

ISSN: 0016-2736,1730-6329

DOI: 10.4064/fm-58-3-309-322